The probabilities of trees and cladograms under Ford's $\alpha$-model
نویسندگان
چکیده
We give correct explicit formulas for the probabilities of rooted binary trees and cladograms under Ford’s α-model.
منابع مشابه
Probabilities on cladograms: introduction to the alpha model
The alpha model, a parametrized family of probabilities on cladograms (rooted binary leaf labeled trees), is introduced. This model is Markovian self-similar, deletion-stable (sampling consistent), and passes through the Yule, Uniform and Comb models. An explicit formula is given to calculate the probability of any cladogram or tree shape under the alpha model. Sackin's and Colless' index are s...
متن کاملOn Consensus, Collapsibility, and Clade Concordance
Consensus in cladistics is reviewed. Consensus trees, which summarize the agreement in grouping among a set of cladograms, are distinguished from compromise trees, which may contain groups that do not appear in all the cladograms being compared. Only a strict or Nelson tree is an actual consensus. This distinction has implications for the concept of support for cladograms: only those branches s...
متن کاملHedonic Pricing under Uncertainty: A Theoretical Consumer Behavior Model
A model of consumer behavior has been formulated by using an additive utility function and the hedonic pricing approach, in a virtual market. Since, there is a time lag between ordering and purchasing products (goods and services) online and receiving them, it means the consumer makes decision under uncertainty. The level of satisfaction with products with distinctive characteristics is describ...
متن کاملAmino acid sequence versus morphological data and the interordinal relationships of mammals.
To a large extent, the mutual affinities of the mammalian orders continue to puzzle systematists, even though comparative anatomy and amino acid sequencing offer a massive data base from which these relationships could potentially be adduced. In the present paper the consistency index--the number of character states less the number of characters in a data set, divided by the total number of cha...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کامل